RSUs Deployment Using Parallel Scheduling
نویسندگان
چکیده
منابع مشابه
Scalable TDB based RSUs deployment in VANETs
Vehicular ad hoc networks (VANETs) are the flaming topic of research. VANET comprises of moving vehicles communicating with each other. VANETs involve three types of communication: vehicle to vehicle (V2V), vehicle to roadside (V2R) or vehicle to infrastructure (V2I) communication. VANETs consist of some vital components: RSU, OBU and Trusted Authority. Among them Roadside units (RSUs) are one ...
متن کاملTDB Based Optimistic RSUs Deployment in VANETs
Now–a–days Vehicular Ad Hoc Networks (VANETs) has attracted the attention of both the industry and academia. Roadside units (RSUs) are one of the fundamental components of Vehicular ad hoc network (VANET). VANET comprises of moving vehicles communicating with each other. During the initial stages of VANET, it is not possible to deploy more and more number of RSUs; it is so because of the lack o...
متن کاملEvaluation of scheduling solutions in parallel processing using DEA FDH model
This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
متن کاملImproving Parallel Job Scheduling Using Runtime Measurements
We investigate the use of runtime measurements to improve job scheduling on a parallel machine. Emphasis is on gang scheduling based strategies. With the information gathered at runtime, we deene a task classiication scheme based on fuzzy logic and Bayesian estimators. The resulting local task classiication is used to provide better service to I/O bound and interactive jobs under gang schedulin...
متن کاملCompanyEFFICIENT PARALLEL JOB SCHEDULING USING GANGSERVICE
Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. To overcome some of the limitations of traditional Gang scheduling algorithms, Concurrent Gang is proposed as a class of scheduling policies which allows the exible and simultaneous scheduling of multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Network and Information Security
سال: 2014
ISSN: 2074-9090,2074-9104
DOI: 10.5815/ijcnis.2014.05.06